/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2024-07-17
 * Time: 11:38
 */
class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int n = nums.length,ret = 0;
        for(int i = 0; i < n;) {
            int j = i+1;
            while(j < n && nums[j] > nums[j-1]) {
                j++;
            }
            ret = Math.max(ret,j-i);
            i = j;//贪心
        }
        return ret;
    }
}
